Heterogeneous Multi-resource Allocation with Subset Demand Requests

We consider the problem of allocating multiple heterogeneous resources geographically and over time to meet demands that require some subset available resource types simultaneously at a specified time, location, duration. The objective is maximize total reward accrued from meeting (a of) demands. model this as an integer program, show it NP-hard, analyze complexity various special cases. introduce approximation algorithms extension our considers travel costs. Finally, we test performance programming in extensive computational study.